LES ESPACES DE CALCULS A COMMANDE ITERATIVESKRZYPKOWSKI T.1976; PRACE C.O. P.A.N.; POLSKA; DA. 1976; NO 249; PP. 1-29; ABS. ANGL. RUSSE; BIBL. 4 REF.Serial Issue

GENERATIVE MODELS FOR PARALLEL PROCESSES.ROZENBERG G; WOOD D.1974; COMPUTER J.; G.B.; DA. 1974; VOL. 17; NO 4; PP. 344-348; BIBL. 3 P.Article

UNE PROPRIETE DE NON-AMBIGUITE DES GENERATEURS ALGEBRIQUES.BEAUQUIER J.1976; C.R. ACAD. SCI., A; FR.; DA. 1976; VOL. 282; NO 20; PP. 1203-1205; ABS. ANGL.Article

WPROWADZENIE DO INFORMATYKI. = INTRODUCTION A L'INFORMATIQUEMARONSKI J; MURASZKIEWICZ MR; NOWICKI Z et al.1975; WARSZAWA; PANSTW. WYDAWN. NAUK.; DA. 1975; PP. 1-157; ABS. ANGL. RUSSE; BIBL. 36 REF.Book

AN INTRODUCTORY DISCRETE STRUCTURES COURSE IN COMPUTER SCIENCE.TREMBLAY JP; MANOHAR R.1974; INFOR; CANADA; DA. 1974; VOL. 12; NO 2; PP. 196-204; ABS. FR.; BIBL. 9 REF.Article

AN OPERATOR EMBEDDING THEOREM FOR COMPLEXITY CLASSES OF RECURSIVE FUNCTIONS.MOLL R.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 3; PP. 193-198; BIBL. 13 REF.Article

AN OPTIMAL BOUND FOR TWO DIMENSIONAL BIN PACKING.KLEITMAN DJ; KRIEGER MM.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 163-168; BIBL. 5 REF.Conference Paper

PROVING PROPERTIES OF PROCESSES. = DEMONSTRATION DES PROPRIETES DES PROCESSUSMAZURKIEWICZ A.1974; ALGORYTMY; POLSKA; DA. 1974; VOL. 11; NO 19; PP. 5-22; ABS. POL. RUSSE; BIBL. 9 REF.Article

ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING. 6; SEATTLE, WASH.; 1974.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 12; NO 2; PP. 133-268; BIBL. DISSEM.Conference Paper

LEAST FIXED POINTS AND THE RECURSION THEOREM.VAN EMDE BOAS P.1976; STICHTG MATH. CENTRUM, AFD. ZUEWERE WISKDE; NEDERL.; DA. 1976; NO 78; PP. 1-10; BIBL. 11 REF.Serial Issue

ALGORITHMES UNIVERSELS.NOLIN L.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R; FR.; DA. 1974; VOL. 8; NO 1; PP. 1-18; ABS. ANGL.; BIBL. 2 REF.Article

THEORY OF COMPUTING.1975; IN: 8TH HAWAII INT. CONF. SYST. SCI. PROC.; HONOLULU; 1975; NORTH HOLLYWOOD; WESTERN PERIODICALS CO.; DA. 1975; PP. 1-18; BIBL. DISSEM.Conference Paper

THEORIE DES ALGORITHMES, DES LANGAGES ET DE LA PROGRAMMATION. SEMINAIRE IRIA; ROCQUENCOURT; 1974.1975; ROCQUENCOURT; INST. RECH. INF. AUTOM.; DA. 1975; PP. 1-129; BIBL. DISSEM.; ISBN 2726100627Conference Proceedings

BASES FOR CHAIN-COMPLETE POSETS.MARKOWSKY G; ROSEN BK.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 34-47; BIBL. 17 REF.Conference Paper

SOCIAL CHOICE AND FORMAL LANGUAGE THEORY.PICCOLI ML; WHINSTON A.1973; J. CYBERN.; U.S.A.; DA. 1973; VOL. 3; NO 2; PP. 40-50; BIBL. 9 REF.Article

BIBLIOGRAPHY OF L SYSTEMS.ROZENBERG G; PENTTONEN M; SALOMAA A et al.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977 PARU 1978; VOL. 5; NO 3; PP. 339-354Article

ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 16; BERKELEY, CALIF; 1975.1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. (198P.); BIBL. DISSEM.Conference Proceedings

FRONTIERS OF INFINITE TREES.COURCELLE B.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1978; NO 272; PP. 1-26; ABS. FR.; BIBL. 6 REF.Serial Issue

A NOTE ON EQUAL POWERS OF WORD MORPHISMS.RUOHONEN K.1977; R.A.I.R.O. INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 3; PP. 207-211; BIBL. 4 REF.Article

UPRAVLENIE INFORMATSIYA INTELLEKT. = COMMANDE. INFORMATION. INTELLIGENCEBERGA AI; BIRYUKOVA BV; GELLERA ES et al.1976; MOSKVA; MYSL; DA. 1976; PP. 1-383; BIBL. DISSEM.Book

MODELES ORDONNES DANS UN PRODUIT DIRECT D'ORDRES TOTAUX. APPLICATIONS A L'ANALYSE DES QUESTIONNAIRES.KERGALL Y.1975; ; S.L.; DA. 1975; PP. (230P.); BIBL. 3 P. 1/2; (THESE DOCT. 3EME CYCLE, INF.; UNIV. SCI. MED. GRENOBLE)Thesis

ISOMORPHISM, FORM EQUIVALENCE AND SEQUENCE EQUIVALENCE OF PDOL FORMS.CULIK K II; MAURER HA; OTTMANN T et al.1978; THEOR. COMPUTER SCI.; NETHERL.; DA. 1978; VOL. 6; NO 2; PP. 143-173; BIBL. 5 REF.Article

THE DENSEST HEMISPHERE PROBLEM.JOHNSON DS; PREPARATA FP.1978; THEOR. COMPUTER SCI.; NETHERL.; DA. 1978; VOL. 6; NO 1; PP. 93-107; BIBL. 4 REF.Article

A CONSTRUCTIVE CHARACTERIZATION OF THE LATTICES OF ALL RETRACTIONS, PRECLOSURE, QUASI-CLOSURE AND CLOSURE OPERATORS ON A COMPLETE LATTICECOUSOT P; COUSOT R.1978; MATH. APPL. INFORMAT., RAPP. RECH.; FRA; DA. 1978; NO 128; PP. 1-15; BIBL. 1 P.Serial Issue

UTILISATION DES LANGAGES FORMELS EN THEORIE DES CHAMPS.CALMET J.1977; BULL. SOC. MATH. FR., SUPPL.; FR.; DA. 1977; PP. 31-39; BIBL. 15 REF.; (UTIL. CALE MATH. PURES. JOURN. CONF.; LIMOGES; 1975)Conference Paper